Solving min-max problems and linear semi-infinite programs
نویسندگان
چکیده
منابع مشابه
Reducing Linear Programs into Min-max Problems
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of [1].
متن کاملFirst-Order Algorithms for Generalized Semi-Infinite Min-Max Problems
We present a first-order algorithm for solving semi-infinite generalized min-max problems which consist of minimizing a function f0(x) = F (ψ1(x), ...., ψm(x)), where F is a smooth function and each ψi is the maximum of an infinite number of smooth functions. In Section 3.3 of [17] Polak finds a methodology for solving infinite dimensional problems by expanding them into an infinite sequence of...
متن کاملA Hough Transform Approach to Solving Linear Min-Max Problems
We begin with a quick overview of a natural extension to the Hough Transform Hough (1962) to 3D. We note that the following theorems, although proved for 3D, hold equally well in 2D; the proofs are identical if we rename the z coordinate into y. Given a point p = (a, b, c) in R, we define its dual plane as H (p) = ` (x, y) = ax + by − c, and given a plane π (x, y) = ax + by + c, we define its d...
متن کاملSolving Semi-infinite Linear Programs Using Boosting-Like Methods
Linear optimization problems (LPs) with a very large or even infinite number of constraints frequently appear in many forms in machine learning. A linear program with m constraints can be written as min x∈P n c x with a where I assume for simplicity that the domain of x is the n dimensional probability simplex P n. Optimization problems with an infinite number of constraints of the form a j x ≤...
متن کاملSecond-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
We present two second-order algorithms, one for solving a class of finite generalized min-max problems and one for solving semi-infinite generalized min-max problems. Our algorithms make use of optimality functions based on second-order approximations to the cost function and of corresponding search direction functions. Under reasonable assumptions we prove that both of these algorithms converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00145-9